Automatic Tuning of GRASP with Evolutionary Path-Relinking
نویسندگان
چکیده
Heuristics for combinatorial optimization are often controlled by discrete and continuous parameters that define its behavior. The number of possible configurations of the heuristic can be large, resulting in a difficult analysis. Manual tuning can be time-consuming, and usually considers a very limited number of configurations. An alternative to manual tuning is automatic tuning. In this paper, we present a scheme for automatic tuning of GRASP with evolutionary path-relinking heuristics. The proposed scheme uses a biased random-key genetic algorithm (BRKGA) to determine good configurations. We illustrate the tuning procedure with experiments on three optimization problems: set covering, maximum cut, and node capacitated graph partitioning. For each problem we automatically tune a specific GRASP with evolutionary path-relinking heuristic to produce fast effective procedures.
منابع مشابه
Grasp with Evolutionary Path-relinking
We propose GRASP with evolutionary path-relinking, a metaheuristic resulting from the hybridization of GRASP, path-relinking, and evolutionary path-relinking. This metaheuristic is applied to a network migration problem. Experiments show that a GRASP with evolutionary path-relinking heuristic finds solutions faster than a heuristic based on GRASP with path-relinking as well as one based on pure...
متن کاملAutomatic Tuning of GRASP with Path-Relinking Heuristics with a Biased Random-Key Genetic Algorithm
GRASP with path-relinking (GRASP+PR) is a metaheuristic for finding optimal or near-optimal solutions of combinatorial optimization problems. This paper proposes a new automatic parameter tuning procedure for GRASP+PR heuristics based on a biased random-key genetic algorithm (BRKGA). Given a GRASP+PR heuristic with n input parameters, the tuning procedure makes use of a BRKGA in a first phase t...
متن کاملGRASP with evolutionary path-relinking for the capacitated arc routing problem
The Capacitated Arc Routing Problem (CARP) is a well-known NP-hard combinatorial optimization problem where, given an undirected graph, the objective is to find a minimum cost set of tours servicing a subset of required edges under vehicle capacity constraints. There are numerous applications for the CARP, such as street sweeping, garbage collection, mail delivery, school bus routing, and meter...
متن کاملGrasp with Path-relinking: Recent Advances and Applications
Path-relinking is a major enhancement to the basic greedy randomized adaptive search procedure (GRASP), leading to significant improvements in solution time and quality. Path-relinking adds a memory mechanism to GRASP by providing an intensification strategy that explores trajectories connecting GRASP solutions and the best elite solutions previously produced during the search. This paper revie...
متن کاملA hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering
The set multicovering or set k-covering problem is an extension of the classical set covering problem, in which each object is required to be covered at least k times. The problem finds applications in the design of communication networks and in computational biology. We describe a GRASP with pathrelinking heuristic for the set k-covering problem, as well as the template of a family of Lagrange...
متن کامل